At the Crossroads of Linguistics, DNA Computing, and Formal Language Theory: Characterizing RE Using Insertion-Deletion Systems
نویسندگان
چکیده
Several characterizations of recursively enumerable (RE) languages are presented, using insertion-deletion systems. Such a system generates the elements of a language by inserting and deleting words, according to their contexts (the insertiondeletion rules are triples (u, z, v), with the meaning that z can be inserted or deleted in/from the context (u, v)). Grammars based on insertion rules were already considered in [6] with linguistic motivation. Insertion/deletion operations are also basic in DNA and RNA processing, [2]. Our results show that these operations, even with strong restrictions on the length of the contexts and/or on the length or on the form of the inserted/deleted words are computationally complete, they can simulate the work of any Turing machine. A problem formulated in [23] is solved in this context. Research supported by Grant OGP0007877 of the Natural Sciences and Engineering Research Council of Canada and by Project 11281 of the Academy of Finland
منابع مشابه
Modelling Intermolecular Structures and Defining Ambiguity in Gene Sequences using Matrix Insertion-Deletion Systems
Gene insertion and deletion are considered as the basic operations in DNA processing and RNA editing. Based on these evolutionary transformations, a computing model has been formulated in formal language theory known as insertion-deletion systems. Recently, in [6], a new computing model named Matrix insertion-deletion system has been introduced to model various bio-molecular structures such as ...
متن کاملRepresentations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems
Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing computability were obtained in this framework. In this note we contribute to this research direction with a new characterization of this type, as well as with representations of regular and context-free languages, mainly starting from context-free insertion systems of ...
متن کاملRestricted Insertion-Deletion Systems
In the past few years several paper showed, that various generative mechanisms in formal language theory that used context-dependent insertions and deletions are capable of generating any recursively enumerable languages [1, 2, 3, 4, 5, 6, 7, 8, 9]. Since such systems are also models of molecular computing, for practical reasons it is important to examine these systems in a restricted case, in ...
متن کاملOn the Ambiguity and Complexity Measures of Insertion-Deletion Systems
In DNA processing and RNA editing, gene insertion and deletion are considered as the basic operations. Based on the above evolutionary transformations, a computing model has been formulated in formal language theory known as insertion-deletion systems. In this paper we study about ambiguity and complexity measures of these systems. First, we define the various levels of ambiguity (i = 0, 1, 2, ...
متن کاملA N R I-d S
In the past few years several papers showed, that various generative mechanisms in formal language theory that use insertion and deletion operations are capable of generating any recursively enumerable languages [1, 2, 3, 4, 5, 6, 7, 8, 9]. Since such systems are also models of molecular computing, for practical reasons it is important to examine these systems in a restricted case, in which the...
متن کامل